Incremental Reconstruction of Generalized Voronoi Diagrams on Grids
نویسندگان
چکیده
We present an incremental algorithm for constructing and reconstructing Generalized Voronoi Diagrams (GVDs) on grids. Our algorithm, Dynamic Brushfire, uses techniques from the path planning community to efficiently update GVDs when the underlying environment changes or when new information concerning the environment is received. Dynamic Brushfire is an order of magnitude more efficient than current approaches. In this paper we present the algorithm, compare it to current approaches on several experimental domains involving both simulated and real data, and demonstrate its usefulness for multirobot path planning.
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملRandomized construction diagrams * incremental of abstract Voronoi Rolf
Abstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(n log n) by a randomized algorithm, which is based on Clarkson and Shor’s randomized incremental construction technique (1989). The new algorithm has the following advantages over previous algorithms: l It can handle a much wider cl...
متن کاملInteractive Analysis Using Voronoi Diagrams: Algorithms to Support Dynamic Update from a Generic Triangle-based Data Structure
This paper describes a series of dynamic update methods that can be applied to a family of Voronoi diagram types, so that changes can be updated incrementally, without the usual recourse to complete reconstruction of their underlying data structure. More efficient incremental update methods are described for the ordinary Voronoi diagram, the farthest-point Voronoi diagram, the order-k Voronoi d...
متن کاملDeletion in abstract Voronoi diagrams in expected linear time
Updating an abstract Voronoi diagram in linear time, after deletion of one site, has been an open problem for a long time. Similarly for various concrete Voronoi diagrams of generalized sites, other than points. In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion. We introduce the concept of a Voronoi-like diagram, a relaxed ver...
متن کاملRandomized Incremental Construction of Abstract Voronoi Diagrams
Abstract Voronoi diagrams were introduced by R . Klein [Kle89b, Kle88a, Kle88b] as an axiomatic basis ofVoronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(nlogn) by a randomized algorithm, which is based on Clarkson and Shor's randomized incremental construction technique [CS89]. The new algorithm has the following advantages over previous algorithms: • It can handle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Robotics and Autonomous Systems
دوره 57 شماره
صفحات -
تاریخ انتشار 2006